#include <cstdio>

using namespace std;

const int maxn=1000;

int get(int f[][maxn+1], int x, int y, int u, int v) {
    return f[u][v]-f[u][y]-f[x][v]+f[x][y];
}

int main() {
    freopen("lcyrcx.in", "r", stdin);
    freopen("lcyrcx.out", "w", stdout);

    static int map[maxn+1][maxn+1], f[maxn+1][maxn+1];
    int n, k, cnt=0, fx=0, fy;
    scanf("%d %d", &n, &k);
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=n; j++) {
            scanf("%1d", &map[i][j]);
            cnt += !map[i][j];
            f[i][j] = f[i-1][j]+f[i][j-1]-f[i-1][j-1]+map[i][j];
        }
    }

    bool flag=false;
    for (int i=k; i<=n && !flag; i++) {
        for (int j=k; j<=n && !flag; j++) {
            if (!get(f, i-k, j-k, i, j)) {
                if (!fx) fx=i, fy=j;
                else flag = (i-fx>=k && j-fy>=k);
            }
        }
    }
    fx = 0;
    for (int j=k; j<=n && !flag; j++) {
        for (int i=k; i<=n && !flag; i++) {
            if (!get(f, i-k, j-k, i, j)) {
                if (!fx) fx=i, fy=j;
                else flag = (i-fx>=k && j-fy>=k);
            }
        }
    }

    bool ans = flag ? cnt%2 : (fx ? true : false);
    printf(ans ? "rx\n" : "yc\n");

    fclose(stdin);
    fclose(stdout);
    return 0;
}
